f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X
F(f(a)) → F(g(n__f(n__a)))
ACTIVATE(n__a) → A
ACTIVATE(n__f(X)) → F(activate(X))
ACTIVATE(n__f(X)) → ACTIVATE(X)
f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
F(f(a)) → F(g(n__f(n__a)))
ACTIVATE(n__a) → A
ACTIVATE(n__f(X)) → F(activate(X))
ACTIVATE(n__f(X)) → ACTIVATE(X)
f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
ACTIVATE(n__f(X)) → ACTIVATE(X)
f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVATE(n__f(X)) → ACTIVATE(X)
The value of delta used in the strict ordering is 4.
POL(n__f(x1)) = 1 + (4)x_1
POL(ACTIVATE(x1)) = (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X